/*
Date:20210521 10:18AM
key:做完300 马上看出来了
*/
class Solution {
public:
    int findLengthOfLCIS(vector<int>& nums) 
    {
        int n=nums.size();
        int*dp=new int[n];
        dp[0]=1;
        for(int i=1;i<n;i++)
        {
            if(nums[i]<=nums[i-1])
            {
                dp[i]=1;
            }
            else
            {
                dp[i]=dp[i-1]+1;
            }
        }
        return *max_element(dp,dp+n);
    }
};